全文获取类型
收费全文 | 12651篇 |
免费 | 2154篇 |
国内免费 | 1619篇 |
专业分类
电工技术 | 890篇 |
综合类 | 1327篇 |
化学工业 | 571篇 |
金属工艺 | 268篇 |
机械仪表 | 505篇 |
建筑科学 | 176篇 |
矿业工程 | 107篇 |
能源动力 | 197篇 |
轻工业 | 112篇 |
水利工程 | 115篇 |
石油天然气 | 181篇 |
武器工业 | 149篇 |
无线电 | 1830篇 |
一般工业技术 | 1129篇 |
冶金工业 | 390篇 |
原子能技术 | 32篇 |
自动化技术 | 8445篇 |
出版年
2024年 | 44篇 |
2023年 | 200篇 |
2022年 | 364篇 |
2021年 | 401篇 |
2020年 | 482篇 |
2019年 | 464篇 |
2018年 | 405篇 |
2017年 | 594篇 |
2016年 | 624篇 |
2015年 | 752篇 |
2014年 | 922篇 |
2013年 | 1057篇 |
2012年 | 1063篇 |
2011年 | 1087篇 |
2010年 | 832篇 |
2009年 | 913篇 |
2008年 | 964篇 |
2007年 | 919篇 |
2006年 | 747篇 |
2005年 | 630篇 |
2004年 | 489篇 |
2003年 | 395篇 |
2002年 | 349篇 |
2001年 | 316篇 |
2000年 | 241篇 |
1999年 | 171篇 |
1998年 | 127篇 |
1997年 | 138篇 |
1996年 | 113篇 |
1995年 | 93篇 |
1994年 | 78篇 |
1993年 | 71篇 |
1992年 | 56篇 |
1991年 | 41篇 |
1990年 | 38篇 |
1989年 | 35篇 |
1988年 | 26篇 |
1987年 | 15篇 |
1986年 | 17篇 |
1985年 | 14篇 |
1984年 | 14篇 |
1983年 | 15篇 |
1982年 | 20篇 |
1981年 | 14篇 |
1980年 | 15篇 |
1979年 | 12篇 |
1978年 | 6篇 |
1977年 | 6篇 |
1976年 | 7篇 |
1975年 | 9篇 |
排序方式: 共有10000条查询结果,搜索用时 46 毫秒
1.
2.
A random placement of large-scale sensor network in the outdoor environment often causes low coverage.An area coverage optimization algorithm of mobile sensor network (MSN) based on virtual force perturbation and Cuckoo search (VF-CS) was proposed.Firstly,the virtual force of the sensor nodes within the Thiessen polygon was analyzed based on the partitioning of Voronoi diagram of the monitoring area.Secondly,the force of polygon vertices and neighbor nodes was taken as the perturbation factor for updating the node’s location of the Cuckoo search (CS).Finally,the VF-CS guided the node to move so as to achieve the optimal coverage.The simulation results demonstrate that the proposed algorithm has higher coverage and shorter average moving distance of nodes than the Voronoi diagram based algorithms in literatures. 相似文献
3.
Search results of spatio-temporal data are often displayed on a map, but when the number of matching search results is large, it can be time-consuming to individually examine all results, even when using methods such as filtered search to narrow the content focus. This suggests the need to aggregate results via a clustering method. However, standard unsupervised clustering algorithms like -means (i) ignore relevance scores that can help with the extraction of highly relevant clusters, and (ii) do not necessarily optimize search results for purposes of visual presentation. In this article, we address both deficiencies by framing the clustering problem for search-driven user interfaces in a novel optimization framework that (i) aims to maximize the relevance of aggregated content according to cluster-based extensions of standard information retrieval metrics and (ii) defines clusters via constraints that naturally reflect interface-driven desiderata of spatial, temporal, and keyword coherence that do not require complex ad-hoc distance metric specifications as in -means. After comparatively benchmarking algorithmic variants of our proposed approach – RadiCAL – in offline experiments, we undertake a user study with 24 subjects to evaluate whether RadiCAL improves human performance on visual search tasks in comparison to -means clustering and a filtered search baseline. Our results show that (a) our binary partitioning search (BPS) variant of RadiCAL is fast, near-optimal, and extracts higher-relevance clusters than -means, and (b) clusters optimized via RadiCAL result in faster search task completion with higher accuracy while requiring a minimum workload leading to high effectiveness, efficiency, and user satisfaction among alternatives. 相似文献
4.
文章首先总结了电力企业信息管理系统的现状,提出了多源信息管理系统融合集成的邦联、子集和完全融合3种方式,分析了3种方式的优缺点,以建设企业"互联网搜索"型数字引擎为目标,提出了融合基于本体的图数据库建模,多维关联与路径因果分析,和人机共生互动可视化决策于一体的企业信息管理系统技术发展趋势;在系统分析目前正在快速发展的图数据库技术与传统关系数据库之间的本质区别基础上,总结原创的电力图计算平台技术的特点;在此基础上讨论"电网一张图"在建设能源互联网时空信息管理平台数据关联索引图中的核心作用,提出了支持能源互联网建设的"电网一张图"时空信息管理系统的技术架构与特点,最后总结"电网一张图"时空信息管理系统在提高电网安全运行水平、提升客户服务水平、增强清洁能源消纳水平、改善经营绩效水平、以及为综合能源服务和建设能源生态等提供数据服务方面的广阔应用场景。 相似文献
5.
ABSTRACTFeature selection is an important task to improve the classifier’s accuracy and to decrease the problem size. A number of methodologies have been presented for feature selection problems using metaheuristic algorithms. In this paper, an improved self-adaptive inertia weight particle swarm optimisation with local search and combined with C4.5 classifiers for feature selection algorithm is proposed. In this proposed algorithm, the gradient base local search with its capacity of helping to explore the feature space and an improved self-adaptive inertia weight particle swarm optimisation with its ability to converge a best global solution in the search space. Experimental results have verified that the SIW-APSO-LS performed well compared with other state of art feature selection techniques on a suit of 16 standard data sets. 相似文献
6.
Nicholas Vergeylen Kenneth Srensen Pieter Vansteenwegen 《International Transactions in Operational Research》2020,27(6):2695-2714
This paper introduces an efficient algorithm for the bike request scheduling problem (BRSP). The BRSP is built around the concept of request, defined as the pickup or dropoff of a number of identical items (bikes) at a specific station, within a certain time window, and with a certain priority. The aim of the BRSP is to sequence requests on (and hence determine the routes of) a set of vehicles, in such a way that the sum of the priorities of the executed requests is maximized, all time windows are respected, and the capacity of the vehicles is not exceeded. The generation of the set of requests is explicitly not a part of the problem definition of the BRSP. The primary application of the BRSP, from which it derives its name, is to determine the routes of a set of repositioning vehicles in a bike sharing system, although other applications exist. The algorithm introduced in this paper is based on a set of related greedy randomized adaptive search procedure followed by variable neighborhood descent (GRASP + VND) operators embedded in a large neighborhood search (LNS) framework. Since this paper presents the first heuristic for the BRSP, a computational comparison to existing approaches is not possible. We therefore compare the solutions found by our LNS heuristic to those found by an exact solver (Gurobi). These experiments confirm that the proposed algorithm scales to realistic dimensions and is able to find near‐optimal solutions in seconds. 相似文献
7.
This paper proposes a novel hybrid technique called enhanced grey wolf optimization-sine cosine algorithm-cuckoo search (EGWO-SCA-CS) algorithm to improve the electrical power system stability. The proposed method comprises of a popular grey wolf optimization (GWO) in an enhanced and hybrid form. It embraces the well-balanced exploration and exploitation using the cuckoo search (CS) algorithm and enhanced search capability through the sine cosine algorithm (SCA) to elude the stuck to the local optima. The proposed technique is validated with the 23 benchmark functions and compared with state-of-the-art methods. The benchmark functions consist of unimodal, multimodal function from which the best suitability of the proposed technique can be identified. The robustness analysis also presented with the proposed method through boxplot, and a detailed statistical analysis is performed for a set of 30 individual runs. From the inferences gathered from the benchmark functions, the proposed technique is applied to the stability problem of a power system, which is heavily stressed with the nonlinear variation of the load and thereby operating conditions. The dynamics of power system components have been considered for the mathematical model of a multimachine system, and multiobjective function has been framed in tuning the optimal controller parameters. The effectiveness of the proposed algorithm has been assessed by considering two case studies, namely, (i) the optimal controller parameter tuning, and (ii) the coordination of oscillation damping devices in the power system stability enhancement. In the first case study, the power system stabilizer (PSS) is considered as a controller, and a self-clearing three-phase fault is considered as the system uncertainty. In contrast, static synchronous compensator (STATCOM) and PSS are considered as controllers to be coordinated, and perturbation in the system states as uncertainty in the second case study. 相似文献
8.
针对SIFT描述子实时性差和传统二进制描述子对尺度、旋转和视角变化鲁棒性差的问题,本文通过优化采样模式和添加灰度差分不变量比较测试进行改进,提出了一种鲁棒性更高的二进制描述子。首先,设计了一种尺度关联、编号标记的采样模式;然后,旋转采样模式中各采样点到特定位置,确保描述子尺度、旋转不变性;接着,分析了采样点点对模式对描述子的影响,选择使用机器学习训练后的128对采样点对;最后,选择灰度值比较测试及梯度绝对值和比较测试构建二进制描述子。实验中采用DoG检测图像关键点,结果表明:本文提出的描述子在描述子构建和描述子匹配上比SIFT描述子分别快84%和67%;在有视角变化的图像匹配上,准确率比传统的二进制描述子高3%~5%,召回率平均要高30%以上。本文提出的特征点描述方法适用于时间要求高的图像匹配领域。 相似文献
9.
This paper mainly illustrates the Tree Seeds Algorithm (TSA) to tackle structural damage identification problem. The damage model is simulated by the alterations of both stiffness and mass parameters. The objective function is introduced by minimizing the differences between the measured and calculated acceleration data. To enhance the performance of the standard TSA, two modifications including the bare-bones Gaussian updated mechanism and the withering process are introduced. The modified algorithm is named after the BGTSA. In the numerical simulation part, the BGTSA is firstly used to make comparisons with several state-of-the-art algorithms on the CEC05. Secondly, the BGTSA is utilized to deal with the structural damage identification problem by optimizing the acceleration-based nonlinear objective function. Numerical experiments involving a simply supported beam and a truss are carried out to verify the effectiveness of the proposed algorithm. The final results show that with low amount of acceleration data, the BGTSA can acquire better identification results compared with other evolutionary algorithms. Therefore the proposed algorithm could be viewed as a potential tool to solve the structural damage identification problem. 相似文献
10.
This article presents a metaheuristic approach, the binary whale optimization algorithm (BWOA), to solve complex, constrained, non-convex, binary-nature profit-based unit commitment (PBUC) optimization problems of a price-taking generation company (GenCo) in the electricity market. To simulate the binary-nature PBUC problem, the continuous, real-value whale position/location is mapped into binary search space through various transfer functions. This article introduces three variants of BWOA using tangential hyperbolic, inverse tangent (arctan) and sigmoidal transfer functions. The effectiveness of the BWOA approaches is examined in test systems with different market mechanisms, i.e. an energy-only market, and energy and reserve market participation with different reserve payment methods. The simulation results are presented, discussed and compared with other existing approaches. The convergence characteristics, solution quality and consistency of the results across different BWOA variants are discussed. The superiority and statistical significance of the proposed approaches with respect to existing approaches is also presented. 相似文献